- Hölzl, Rupert and Porter, Christoph P., Degrees of randomized computability, Bulletin of Symbolic Logic 28:1 (2022) 27-70
- Hölzl, Rupert and Merkle, Wolfgang and Miller, Joseph and Stephan, Frank and Yu, Liang, Chaitin's Ω as a Continuous Function, The Journal of Symbolic Logic 85:1 (2020) 486-510
- Hölzl, Rupert and Porter, Christopher P., Rank and Randomness, The Journal of Symbolic Logic 84:4 (2019) 1527-1543
- Hölzl, Rupert and Jain, Sanjay and Stephan, Frank, Learning pattern languages over groups, Theoretical Computer Science 742 (2018) 66-81
- Bienvenu, Laurent and Hölzl, Rupert and Porter, Christopher P. and Shafer, Paul, Randomness and Semimeasures, Notre Dame Journal of Formal Logic 58:3 (2017) 301-328
- Hölzl, Rupert and Jain, Sanjay and Stephan, Frank, Learning pattern languages over groups, Theoretical Computer Science (2017)
- Hölzl, Rupert and Porter, Christopher P., Randomness for computable measures and initial segment complexity, Annals of Pure and Applied Logic 168:4 (2017) 860-886
- Hölzl, Rupert and Stephan, Frank and Yu, Liang, On Martin's pointed tree theorem, Computability 5:2 (2016) 147-157
- Hölzl, Rupert and Jain, Sanjay and Stephan, Frank, Inductive inference and reverse mathematics, Annals of Pure and Applied Logic 167:12 (2016) 1242-1266
- Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Probabilistic Computability and Choice, Information and Computation 242 (2015) 249-286
- Hölzl, Rupert and Shafer, Paul, Universality, optimality, and randomness deficiency, Annals of Pure and Applied Logic 166:10 (2015) 1049-1069
- Bienvenu, Laurent and Hölzl, Rupert and Miller, Joseph S. and Nies, André, Denjoy, Demuth and density, J. Math. Log. 14:1 (2014) 1450004, 35
- Hölzl, Rupert and Kräling, Thorsten and Stephan, Frank and Wu, Guohua, Initial segment complexities of randomness notions, Information and Computation 234 (2014) 57-67
- Barmpalias, G. and Hölzl, R. and Lewis, A. E. M. and Merkle, W., Analogues of Chaitin's Omega in the computably enumerable sets, Inform. Process. Lett. 113:5-6 (2013) 171-178
- Bienvenu, Laurent and Day, Adam R. and Hölzl, Rupert, From bi-immunity to absolute undecidability, Journal for Symbolic Logic 78:4 (2013) 1218-1228
- Hölzl, Rupert and Kräling, Thorsten and Merkle, Wolfgang, Time-bounded Kolmogorov complexity and Solovay functions, Theory Comput. Syst. 52:1 (2013) 80-94
- Bienvenu, Laurent and Hölzl, Rupert and Kräling, Thorsten and Merkle, Wolfgang, Separations of non-monotonic randomness notions, J. Logic Comput. 22:4 (2012) 701-715
- Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly, Arno, The Vitali Covering Theorem in the Weihrauch Lattice, arXiv 1605.03354 (2016)
- Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Probabilistic Computability and Choice, arXiv 1312.7305 (2013)
- Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly, Arno, The Vitali Covering Theorem in the Weihrauch Lattice, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 188-200
- Hölzl, Rupert and Raghavan, Dilip and Stephan, Frank and Zhang, Jing, Weakly Represented Families in Reverse Mathematics, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 160-187
- Brattka, Vasco and Hölzl, Rupert and Kuyper, Rutger, Monte Carlo Computability, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 17:1-17:14
- Hölzl, Rupert and Jain, Sanjay and Schlicht, Philipp and Seidel, Karen and Stephan, Frank, Automatic Learning from Repetitive Texts, in: Hanneke, Steve and Reyzin, Lev (eds.), International Conference on Algorithmic Learning Theory, ALT 2017, 15-17 October 2017, Kyoto University, Kyoto, Japan, vol. 76 of Proceedings of Machine Learning Research, PMLR, 2017, pages 129-150
- Hölzl, Rupert and Jain, Sanjay and Stephan, Frank, Learning Pattern Languages over Groups, in: Algorithmic Learning Theory - 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings, 2016
- Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Las Vegas Computability and Algorithmic Randomness, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 130-142
- Hölzl, Rupert and Jain, Sanjay and Stephan, Frank, Inductive Inference and Reverse Mathematics, in: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, 2015, pages 420-433
- Bienvenu, Laurent and Hölzl, Rupert and Miller, Joseph S. and Nies, André, The Denjoy alternative for computable functions, in: 29th International Symposium on Theoretical Aspects of Computer Science, vol. 14 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2012, pages 543-554
- Hölzl, Rupert and Kräling, Thorsten and Stephan, Frank and Wu, Guohua, Initial Segment Complexities of Randomness Notions, in: Theoretical Computer Science - 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings, 2010, pages 259-270
- Hölzl, Rupert and Merkle, Wolfgang, Traceable Sets, in: Theoretical Computer Science - 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings, 2010, pages 301-315
- Bienvenu, Laurent and Hölzl, Rupert and Kräling, Thorsten and Merkle, Wolfgang, Separations of Non-monotonic Randomness Notions, in: Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia, 2009
- Hölzl, Rupert and Kräling, Thorsten and Merkle, Wolfgang, Time-bounded Kolmogorov complexity and Solovay functions, in: Mathematical foundations of computer science 2009, vol. 5734 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, pages 392-402
- Hölzl, Rupert and Merkle, Wolfgang, Generation complexity versus distinction complexity, in: Theory and applications of models of computation, vol. 4978 of Lecture Notes in Comput. Sci., Springer, Berlin, 2008, pages 457-466
- Hölzl, Rupert, Kolmogorov complexity, PhD thesis, Naturwissenschaftlich-Mathematische Gesamtfakultät, Ruprecht-Karls-Universität Heidelberg, Heidelberg, Germany, 2010
This publication list has currently 33 entries
